A primal-dual interior point method whose running time depends only on the constraint matrix
نویسندگان
چکیده
This note provides a simpliied proof concerning the paper \A Primal-Dual Interior Point Method Whose Running Time Depends Only on the Constraint Matrix" by the same authors. In particular, we prove that Case II, one of the three cases in the method, can never occur.
منابع مشابه
ABS Solution of equations of second kind and application to the primal-dual interior point method for linear programming
Abstract We consider an application of the ABS procedure to the linear systems arising from the primal-dual interior point methods where Newton method is used to compute path to the solution. When approaching the solution the linear system, which has the form of normal equations of the second kind, becomes more and more ill conditioned. We show how the use of the Huang algorithm in the ABS cl...
متن کاملCircumventing the Slater conundrum in countably infinite linear programs
Duality results on countably infinite linear programs are scarce. Subspaces that admit an interior point, which is a sufficient condition for a zero duality gap, yield a dual where the constraints cannot be expressed using the ordinary transpose of the primal constraint matrix. Subspaces that permit a dual with this transpose do not admit an interior point. This difficulty has stumped researche...
متن کاملPrimal-dual path-following algorithms for circular programming
Circular programming problems are a new class of convex optimization problems that include second-order cone programming problems as a special case. Alizadeh and Goldfarb [Math. Program. Ser. A 95 (2003) 3-51] introduced primal-dual path-following algorithms for solving second-order cone programming problems. In this paper, we generalize their work by using the machinery of Euclidean Jordan alg...
متن کاملExploiting Sparsity in Semidefinite Programming via Matrix Completion I: General Framework
A critical disadvantage of primal-dual interior-point methods compared to dual interior-point methods for large scale semidefinite programs (SDPs) has been that the primal positive semidefinite matrix variable becomes fully dense in general even when all data matrices are sparse. Based on some fundamental results about positive semidefinite matrix completion, this article proposes a general met...
متن کاملA Generic Primal-dual Interior Point Methods Based on a New Kernel Function
In this paper we present a generic primal-dual interior point methods (IPMs) for linear optimization in which the search direction depends on a univariate kernel function which is also used as proximity measure in the analysis of the algorithm. The proposed kernel function does not satisfy all the conditions proposed in [2]. We show that the corresponding large-update algorithm improves the ite...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Math. Program.
دوره 74 شماره
صفحات -
تاریخ انتشار 1996